import {
    arrayToTree
} from './js/算法/二叉树/utils'
import {
    preorderTraversal,
    postorderTraversal,
    inorderTraversal,
    levelOrderRe
} from './js/算法/二叉树/recursion'
import {
    preorder,
    postorder,
    inorder,
    levelOrder
} from './js/算法/二叉树/iteration'
const initData = [1,2,3,4,5,null,8,null,null,6,7,9]
const tree =  arrayToTree(initData)
console.log(levelOrder(tree))
console.log(levelOrderRe(tree))
